Bipartite graph

Results: 300



#Item
51On the Parameterized Complexity for Token Jumping on Graphs Takehiro Ito1 , Marcin Kami´ nski2 , Hirotaka Ono3 , 1 4

On the Parameterized Complexity for Token Jumping on Graphs Takehiro Ito1 , Marcin Kami´ nski2 , Hirotaka Ono3 , 1 4

Add to Reading List

Source URL: rutcor.rutgers.edu

Language: English - Date: 2014-04-14 14:04:38
52Being prepared in a sparse world: the case of KNN graph construction Antoine Boutet Anne-Marie Kermarrec

Being prepared in a sparse world: the case of KNN graph construction Antoine Boutet Anne-Marie Kermarrec

Add to Reading List

Source URL: womencourage.acm.org

Language: English - Date: 2016-08-09 09:13:46
53Journal of Complex Networks, 177–186 doi:comnet/cnv020 Advance Access publication on 21 July 2015 Network installation under convex costs Alexander Gutfraind†

Journal of Complex Networks, 177–186 doi:comnet/cnv020 Advance Access publication on 21 July 2015 Network installation under convex costs Alexander Gutfraind†

Add to Reading List

Source URL: www.levreyzin.com

Language: English - Date: 2016-07-01 10:19:11
54P ERSEUS 3: Visualizing and Interactively Mining Large-Scale Graphs Di Jin Ticha Sethapakdi

P ERSEUS 3: Visualizing and Interactively Mining Large-Scale Graphs Di Jin Ticha Sethapakdi

Add to Reading List

Source URL: www.mlgworkshop.org

Language: English - Date: 2016-08-14 01:22:56
55111  Documenta Math. On the Structure of Covers of Sofic Shifts Rune Johansen

111 Documenta Math. On the Structure of Covers of Sofic Shifts Rune Johansen

Add to Reading List

Source URL: documenta.sagemath.org

Language: English - Date: 2011-04-22 12:51:16
56CS168: The Modern Algorithmic Toolbox Lecture #19: Expander Codes Tim Roughgarden & Gregory Valiant∗ June 1, 2016 In the first lecture of CS168, we talked about modern techniques in data storage (consistent hashing). S

CS168: The Modern Algorithmic Toolbox Lecture #19: Expander Codes Tim Roughgarden & Gregory Valiant∗ June 1, 2016 In the first lecture of CS168, we talked about modern techniques in data storage (consistent hashing). S

Add to Reading List

Source URL: theory.stanford.edu

Language: English - Date: 2016-06-04 09:49:43
57A 3/4-Approximation Algorithm for Maximum ATSP with Weights Zero and One Markus Bl¨ aser Institut f¨ ur Theoretische Informatik, ETH Z¨

A 3/4-Approximation Algorithm for Maximum ATSP with Weights Zero and One Markus Bl¨ aser Institut f¨ ur Theoretische Informatik, ETH Z¨

Add to Reading List

Source URL: www-cc.cs.uni-saarland.de

Language: English - Date: 2013-08-22 13:00:35
58Modes and Cuts in Metabolic Networks: Complexity and Algorithms∗ Vicente Acu˜ na2,3 , Flavio Chierichetti1 , Vincent Lacroix2,3,6 , Alberto Marchetti-Spaccamela1 , Marie-France Sagot2,3 , Leen Stougie4,5

Modes and Cuts in Metabolic Networks: Complexity and Algorithms∗ Vicente Acu˜ na2,3 , Flavio Chierichetti1 , Vincent Lacroix2,3,6 , Alberto Marchetti-Spaccamela1 , Marie-France Sagot2,3 , Leen Stougie4,5

Add to Reading List

Source URL: pbil.univ-lyon1.fr

Language: English - Date: 2008-10-22 02:35:19
591  International Workshop on Web Intelligence and Virtual EnterprisesA comparative study of social network analysis tools

1 International Workshop on Web Intelligence and Virtual EnterprisesA comparative study of social network analysis tools

Add to Reading List

Source URL: wic.litislab.fr

Language: English - Date: 2013-12-09 08:25:56
60On Crown-free Set Families, Diffusion State Difference, and Non-uniform Hypergraphs Edward Boehnlein Let La(n, H) denote the cardinality of the largest family on the Boolean lattice that does not contain H as a subposet.

On Crown-free Set Families, Diffusion State Difference, and Non-uniform Hypergraphs Edward Boehnlein Let La(n, H) denote the cardinality of the largest family on the Boolean lattice that does not contain H as a subposet.

Add to Reading List

Source URL: www.gradschool.sc.edu

Language: English - Date: 2016-08-01 11:18:55